Analýza paralelizovatelnosti programů na základě jejich bytecode

Analýza paralelizovatelnosti programů na základě jejich bytecode Práce se zabývá analýzou možností aplikace algoritmů pro automatickou paralelizaci na programy, u kterých máme k dispozici jejich bytecode, nebo podobný mezikód. Nejdůležitějším vstupem těchto algoritmů je identifikace částí kódu, které by mohly být spuštěny zároveň, tyto části se nazývají nezávislé a právě testování závislostí v kódu je nejtěžší problém automatické paralelizace. Tento problém je v úplně obecném případě algoritmicky neřešitelný a práce se snaží zjistit, jestli je možné najít nezávislosti v bytecode alespoň v nějakém omezeném případě. Prvním krokem analýzy kódu funkce je integrace volaných funkcí, které umožní analyzovat výsledný kód najednou a získat tak přesnější informace. Dále je třeba identifikovat podmíněné skoky a cykly, až pak je teprve možné hledat nezávislosti v kódu a ty potom použít při aplikace paralelizačních algoritmů. Součástí práce je implementace integrace funkcí a analýzy kódu pro platformu Microsoft .NET Framework.Analysis of automatic program parallelization based on bytecode There are many algorithms for automatic parallelization and this work explores the possible application of these algorithms to programs based on their bytecode or similar intermediate code. All these algorithms require the identification of independent code segments, because if two parts of code do not interfere with one another then they can be run in parallel without any danger of data corruption. Dependence testing is an extremely complicated problem and in general application, it is not algorithmically solvable. However, independences can be discovered in special cases and then they can be used as a basis for application of automatic parallelization, like the use of vector instructions. The first step is function inlining that allows the compiler to analyze the code more precisely, without unnecessary dependences caused by unknown functions. Next, it is necessary to identify all control flow constructs, like loops, and after that the compiler can attempt to locate dependences between the statements or instructions. Parallelization can be achieved only if the analysis discovered some independent parts in the code. This work is accompanied by an implementation of function inlining and code analysis for the .NET framework.Department of Software EngineeringKatedra softwarového inženýrstvíFaculty of Mathematics and PhysicsMatematicko-fyzikální fakult

Evaluation of suburbanization process in the hinterland of Prague in the period 1990-2020 using remote sensing data

V zázemí Prahy dochází v posledních letech k značným změnám. Obce, kde dříve bydlelo 200 lidí, jsou nyní velké rezidenční čtvrtě se starým jádrem a mnohonásobně vyšším počtem obyvatel. Vysoký nárůst obyvatel a nová zastavěná plocha se projeví také na krajině kolem, ať už odlesněním zbývajících ploch lesního porostu nebo znehodnocením půd nejvyšší jakosti. Cílem této práce bylo popsat průběh suburbanizace vybraných obcí a s ní spojenou změnu krajinného pokryvu za použití dat z dálkového průzkumu Země (DPZ), statistických dat a terénního průzkumu řešeného území. Zároveň identifikovat nástroje, které usměrňují nebo regulují tyto suburbanizační procesy. První část práce je úvodem do dané problematiky, navazuje kapitola o stávajících nástrojích územního rozvoje v České republice (v oblasti strategického a územního plánování). Dále jsou popsány data a metody DPZ, které byly použity pro vypracování mapových výstupů daných oblastí a v neposlední řadě je popsán zemědělský půdní fond (ZPF) zahrnující hodnocení kvality půd ve sledovaném území. Hlavním cílem práce bylo zjistit a ukázat vývoj vybraného zázemí Prahy v letech 1990 až 2020. Výsledky mohou být použity jako podklad pro ještě detailnější rozbor dané oblasti. Klíčová slova: suburbanizace, DPZ, krajinný pokryv, udržitelný rozvoj, rozvoj sídelSignificant changes have taken place in the hinterland of Prague in recent years. The villages, where 200 people used to live, are now large residential areas with an old core and a much larger population. The high increase in population and the new built-up area will also be reflected in the surrounding landscape, either by deforestation of the remaining forest areas or by the degradation of the highest quality soils. The aim of this work was to describe the course of suburbanization of selected municipalities and the associated change in landscape cover using data from remote sensing (RS), statistical data and field survey in the issue. At the same time, identify tools that to some extent, guide or regulate these suburbanization processes. The first part of the work is an introduction to the issue, followed by a chapter on standard regulatory measures in Czech Republic. Furthermore, the data and methods of remote sensing are described, which were used to develop a map output of the areas and last but not least, the agricultural land fund (ZPF) was analyzed focusing on the quality of soils in the monitored area. The main goal of the work was to find out and show the development of a selected background of Prague in the years 1990 to 2020. The results can be used as a basis for an even more...Department of Applied Geoinformatics and CartographyKatedra aplikované geoinformatiky a kartografieFaculty of SciencePřírodovědecká fakult

Analýza paralelizovatelnosti programů na základě jejich bytecode

Analýza paralelizovatelnosti programů na základě jejich bytecode Práce se zabývá analýzou možností aplikace algoritmů pro automatickou paralelizaci na programy, u kterých máme k dispozici jejich bytecode, nebo podobný mezikód. Nejdůležitějším vstupem těchto algoritmů je identifikace částí kódu, které by mohly být spuštěny zároveň, tyto části se nazývají nezávislé a právě testování závislostí v kódu je nejtěžší problém automatické paralelizace. Tento problém je v úplně obecném případě algoritmicky neřešitelný a práce se snaží zjistit, jestli je možné najít nezávislosti v bytecode alespoň v nějakém omezeném případě. Prvním krokem analýzy kódu funkce je integrace volaných funkcí, které umožní analyzovat výsledný kód najednou a získat tak přesnější informace. Dále je třeba identifikovat podmíněné skoky a cykly, až pak je teprve možné hledat nezávislosti v kódu a ty potom použít při aplikace paralelizačních algoritmů. Součástí práce je implementace integrace funkcí a analýzy kódu pro platformu Microsoft .NET Framework.Analysis of automatic program parallelization based on bytecode There are many algorithms for automatic parallelization and this work explores the possible application of these algorithms to programs based on their bytecode or similar intermediate code. All these algorithms require the identification of independent code segments, because if two parts of code do not interfere with one another then they can be run in parallel without any danger of data corruption. Dependence testing is an extremely complicated problem and in general application, it is not algorithmically solvable. However, independences can be discovered in special cases and then they can be used as a basis for application of automatic parallelization, like the use of vector instructions. The first step is function inlining that allows the compiler to analyze the code more precisely, without unnecessary dependences caused by unknown functions. Next, it is necessary to identify all control flow constructs, like loops, and after that the compiler can attempt to locate dependences between the statements or instructions. Parallelization can be achieved only if the analysis discovered some independent parts in the code. This work is accompanied by an implementation of function inlining and code analysis for the .NET framework.Katedra softwarového inženýrstvíDepartment of Software EngineeringFaculty of Mathematics and PhysicsMatematicko-fyzikální fakult

Post-synthesis incorporation of Al into germanosilicate ITH zeolites: the influence of treatment conditions on the acidic properties and catalytic behavior in tetrahydropyranylation

Post-synthesis alumination of germanosilicate medium-pore ITH zeolites was shown to be an effective procedure for tuning their acidity. Treatment of ITH zeolites synthesized with different chemical compositions (i.e. Si/Ge = 2.5, 4.4 and 5.8) with aqueous Al(NO3)(3) solution led to the formation of strong Bronsted and Lewis acid sites and an increasing fraction of ultramicro- and meso-pores in Ge-rich ITH samples (Si/Ge = 2.5 and 4.4). The concentration of Al incorporated into the framework increases with decreasing Si/Ge ratio of the parent ITH. The increasing temperature of alumination from 80 to 175 degrees C (HT conditions) resulted in (1) a 1.5-2-fold increase in the concentration of Bronsted acid sites formed and (2) a decreasing fraction of framework Al atoms detectable with base probe molecules (i.e. pyridine, 2,6-di-tert-butylpyridine), i.e. an increased concentration of the "inner" acid sites. The activity of prepared Al-substituted ITH zeolites in tetrahydropyranylation of alcohols is enhanced with increasing amount of accessible acid sites in bulky crystals (e.g. alumination at lower temperature) or with increasing total concentration of acid centres within tiny ITH crystals (e.g. alumination under HT conditions). This trend became more prominent with increasing kinetic diameter of the substrate molecules under investigation (methanol < 1-propanol < 1-hexanol).Post-synthesis alumination of germanosilicate medium-pore ITH zeolites was shown to be an effective procedure for tuning their acidity. Treatment of ITH zeolites synthesized with different chemical compositions (i.e.Si/Ge = 2.5, 4.4 and 5.8) with aqueous5529732984Czech Science Foundation [14-30898P, 13-17593P

Toll-like receptor signaling in thymic epithelium controls monocyte-derived dendritic cell recruitment and Treg generation

The development of thymic regulatory T cells (Treg) is mediated by Aire-regulated self-antigen presentation on medullary thymic epithelial cells (mTECs) and dendritic cells (DCs), but the cooperation between these cells is still poorly understood. Here we show that signaling through Toll-like receptors (TLR) expressed on mTECs regulates the production of specific chemokines and other genes associated with post-Aire mTEC development. Using single-cell RNA-sequencing, we identify a new thymic CD14(+)Sirp alpha (+) population of monocyte-derived dendritic cells (CD14(+)moDC) that are enriched in the thymic medulla and effectively acquire mTEC-derived antigens in response to the above chemokines. Consistently, the cellularity of CD14(+)moDC is diminished in mice with MyD88-deficient TECs, in which the frequency and functionality of thymic CD25(+)Foxp3(+) Tregs are decreased, leading to aggravated mouse experimental colitis. Thus, our findings describe a TLR-dependent function of mTECs for the recruitment of CD14(+)moDC, the generation of Tregs, and thereby the establishment of central tolerance. Immune tolerance is mediated by the deletion of autoreactive T cells via medullary thymic epithelial cells (mTEC) and dendritic cells (DC), and by the induction of regulatory T cells (Treg). Here the authors show that mTEC receiving toll-like receptor signaling control the recruitment of CD14(+)Sirp alpha (+) DC population that is capable of inducing Treg for establishing tolerance

Interactive virtual laboratory for computing uncertain system model from limited experimental data

Cílem této bakalářské práce je představení virtuálních on-line laboratoří a jejich využití v oblasti automatického řízení, speciálně tedy laboratoří pro jednoduchý návrh regulátoru s omezenou strukturou. Na začátku práce je uveden aktuální stav spolu s možnými technikami vývoje a popisem dostupných realizací specializujících se na automatické řízení či robotiku. Další část se pak věnuje identifikaci systémů a jejich neurčitosti. Poslední část tvoří popis virtuální laboratoře, která je hlavním výsledkem této práce. Laboratoř se zaměřuje na výpočet modelu systému s neurčitostí a jednoduchý návrh regulátoru.Katedra kybernetikyObhájenoThe purpose of this Bachelor thesis is introduce virtual on-line laboratories and their applications in the field of automatic control, especially the laboratories for a simple design of the controller with a limited structure. At the beginning of the thesis the state-of-the-art is mentioned. The next part deals with the system identification and uncertainty. The last part of the thesis contains a description of the virtual laboratory, which is the main result of this thesis. The laboratory is focused on calculation of the system model with uncertainty and the simple design of the controller

Analýza paralelizovatelnosti programů na základě jejich bytecode

Analysis of automatic program parallelization based on bytecode There are many algorithms for automatic parallelization and this work explores the possible application of these algorithms to programs based on their bytecode or similar intermediate code. All these algorithms require the identification of independent code segments, because if two parts of code do not interfere with one another then they can be run in parallel without any danger of data corruption. Dependence testing is an extremely complicated problem and in general application, it is not algorithmically solvable. However, independences can be discovered in special cases and then they can be used as a basis for application of automatic parallelization, like the use of vector instructions. The first step is function inlining that allows the compiler to analyze the code more precisely, without unnecessary dependences caused by unknown functions. Next, it is necessary to identify all control flow constructs, like loops, and after that the compiler can attempt to locate dependences between the statements or instructions. Parallelization can be achieved only if the analysis discovered some independent parts in the code. This work is accompanied by an implementation of function inlining and code analysis for the .NET framework

Skeletal Animations in Real-time 3D Graphics

Skeletal Animations in Real-time 3D Graphics Abstract Skeletal animation is an effective technique for the animation of humans and animals, and it is used in most video games to animate complex 3D models. This thesis addresses many problems of the implementation of skeletal animations and it presents an effective solution to the most important ones. It contains all the knowledge necessary to use this important animation method, because it explains all the calculations required to transform a model by its skeleton, and then this thesis presents a complete implementation that uses all the concepts explained there. Build on the skeletal animations, the animation editor is the main application of the thesis, and it allows users to modify animations of 3D models. The animation editor is a graphical application with complex user interface and its construction is explained in a great detail

Analýza paralelizovatelnosti programů na základě jejich bytecode

Analysis of automatic program parallelization based on bytecode There are many algorithms for automatic parallelization and this work explores the possible application of these algorithms to programs based on their bytecode or similar intermediate code. All these algorithms require the identification of independent code segments, because if two parts of code do not interfere with one another then they can be run in parallel without any danger of data corruption. Dependence testing is an extremely complicated problem and in general application, it is not algorithmically solvable. However, independences can be discovered in special cases and then they can be used as a basis for application of automatic parallelization, like the use of vector instructions. The first step is function inlining that allows the compiler to analyze the code more precisely, without unnecessary dependences caused by unknown functions. Next, it is necessary to identify all control flow constructs, like loops, and after that the compiler can attempt to locate dependences between the statements or instructions. Parallelization can be achieved only if the analysis discovered some independent parts in the code. This work is accompanied by an implementation of function inlining and code analysis for the .NET framework